On the semantics of the call-by-name CPS transform
نویسنده
چکیده
Sangiorgi has shown that the semantics induced by Milner's encoding of the call-by-name-calculus in the-calculus is the equality of LLvy-Longo trees. Later it was realized that Milner's encodings are actually variations on well-known continuation passing style transforms. Then a question is: is the discriminating ability due to-calculus features, or is it already ooered by the cps transform? We show that the latter is true: the semantics induced by the call-by-name cps transform on-terms is LLvy-Longo trees equality.
منابع مشابه
Lazy Functions as Processes
CPS transforms have long been important tools in the study of programming languages, especially those related to the λ-calculus. Recently, it has been shown that encodings into process calculi, such as the π-calculus, can also serve as semantics, in the same way as CPS transforms. It is known that common encodings of the call-byvalue and call-by-name λ-calculi into the π-calculus can be seen as...
متن کاملA Call-by-Name CPS Hierarchy
The Continuation-Passing-Style (CPS) translation gives semantics to control operators such as exception and first-class continuations. By iterating this translation, Danvy and Filinski obtained a CPS hierarchy, and used it to specify a series of control operators, hierarchical (or layered) delimited-control operators, We introduce a call-by-name variant of the CPS hierarchy. While most of the w...
متن کاملAnswer Type Polymorphism in Call-by-Name Continuation Passing
This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some answer types are polymorphic, even in the presence of first-class control operators. By building on this polymorphic typing, and using parametricity reasoning, we show that the call-by-name transform satisfies the eta-law, and is...
متن کاملThe Structure of Continuation - Passing StylesbyJohn
Continuation-passing style (CPS) is a method of representing program evaluation order in a purely functional manner. Many applications of CPS rely on CPS transformations which explicitly encode evaluation strategies (e.g., call-by-name, call-by-value, etc.) into the structure of programs. Existing CPS transformations are based almost entirely on the call-by-name and call-by-value CPS transforma...
متن کاملPolymorphic Type Assignment and CPS Conversion
Meyer and Wand established that the type of a term in the simply typed -calculus may be related in a straightforward manner to the type of its call-by-value CPS transform. This typing property may be extended to Scheme-like continuation-passing primitives, from which the soundness of these extensions follows. We study the extension of these results to the Damas-Milner polymorphic type assignmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 234 شماره
صفحات -
تاریخ انتشار 2000